Some small large sets of t-designs

نویسندگان

  • Earl S. Kramer
  • Spyros S. Magliveras
  • Douglas R. Stinson
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the existence of large sets of t-designs of prime sizes1

In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence...

متن کامل

Large sets of t-designs through partitionable sets, a review

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

متن کامل

Large sets of t-designs from t-homogeneous groups

A direct method for constructing large sets of t-designs is based on the concept of assembling orbits of a permutation group G on ksubsets of a v-set into block sets of t-designs so that these designs form a large set. If G is t-homogeneous, then any orbit is a t-design and therefore we obtain a large set by partitioning the set of orbits into parts consisting of the same number of k-subsets. I...

متن کامل

LARGE SETS OF t−DESIGNS FROM GROUPS

This paper addresses questions related to the existence and construction of large sets of t-(v, k, λ) designs. It contains material from my talk in the Combinatorial Designs Conference in honor of Alex Rosa’s 70th birthday, which took place in beautiful Bratislava, in July, 2007. Naturally, only a small number of “highlight” topics could be included, and for the most part these involve the use ...

متن کامل

Some new large sets of t-designs

By constructing a new large set of 4-(13,5,3) designs, and using a recursive construction described recently by Qiu-rong Wu, we produce an infinite family of large sets and as a byproduct an infinite family of new 4-designs. Similarly, we construct a new large set of 3-(13,4,2) designs, and obtain an infinite family of large sets of 3-designs. We also include a large set of 2-(14,4,6) designs, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1991